Reformulating Planning Problems by Eliminating Unpromising Actions
نویسندگان
چکیده
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions is exploiting knowledge engineering techniques such as (re)formulating the planning problem to be easier to solve for existing planners. In particular, it is possible to automatically gather knowledge from toy planning problems and exploit this knowledge when solving more complex planning problems. In this paper we propose a method for eliminating some actions from the problem specification that are often useless or may mislead the planners. The method detects if actions are somehow connected with the initial or goal predicates and by using this information we suggest that some actions are not necessary when solving the planning problem. To eliminate these actions we modify the planning domain and hence the method remains independent of used planning system.
منابع مشابه
Limits for Compact Representation of Plans
Most planning formalisms allow instances with shortest plans of exponential length. While such instances are problematic, they are usually unavoidable and can occur in practice. There are several known cases of restricted planning problems where plans can be exponential but always have a compact (ie. polynomial) representation, often using recursive macros. Such compact representations are impo...
متن کاملReformulating Planning Problems: A Theoretical Point of View
Automated planning is a well studied research topic thanks to its wide range of real-world applications. Despite significant progress in this area many planning problems still remain hard and challenging. Some techniques such as learning macro-operators improve the planning process by reformulating the (original) planning problem. While many encouraging practical results have been derived from ...
متن کاملSolving Difficult Problems by Viewing them as Structured Dense Graphs
We are addressing the solving process over difficult AI problems such as planning and Boolean formula satisfaction in this paper. We propose a method for disentangling the structure of the problem hidden in its formulation. Namely we are viewing the problem as a graph with vertices end edges that we decompose into several complete sub graphs. The clique decomposition of the graph provides us wi...
متن کاملOn Different Strategies for Eliminating Redundant Actions from Plans
Satisficing planning engines are often able to generate plans in a reasonable time, however, plans are often far from optimal. Such plans often contain a high number of redundant actions, that are actions, which can be removed without affecting the validity of the plans. Existing approaches for determining and eliminating redundant actions work in polynomial time, however, do not guarantee elim...
متن کاملReformulating Constraint Models for Classical Planning
Constraint satisfaction techniques are commonly used for solving scheduling problems, still they are rare in AI planning. Although there are several attempts to apply constraint satisfaction for solving AI planning problems, these techniques never became predominant in planning; and they never reached the success of, for example, SATbased planners. In this paper we argue that existing constrain...
متن کامل